Relations in SO ( 3 ) supported by geodetic anglesbyJohn
نویسندگان
چکیده
We consider rotations A; B of nite order in SO(3), about axes separated by an angle of restricted type, and attempt to classify the possible group relations between A and B. We show that the relations responsible for the symmetries of the Platonic solids have consequencies far beyond that simple geometric setting.
منابع مشابه
Relations in SO (3) Supported by Geodetic Angles
We consider rotations A, B of finite order in SO(3), about axes separated by an angle of restricted type, and attempt to classify the possible group relations between A and B. We show that the relations responsible for the symmetries of Platonic solids have consequences far beyond that simple geometric setting.
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملTransforming Geocentric Cartesian Coordinates to Geodetic Coordinates by a New Initial Value Calculation Paradigm
Transforming geocentric Cartesian coordinates (X, Y, Z) to geodetic curvilinear coordinates (φ, λ, h) on a biaxial ellipsoid is one of the problems used in satellite positioning, coordinates conversion between reference systems, astronomy and geodetic calculations. For this purpose, various methods including Closed-form, Vector method and Fixed-point method have been developed. In this paper, a...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملThe geodetic number of lexicographic product of graphs ∗
A set S of vertices of a graph G is a geodetic set if every vertex of G lies in an interval between two vertices from S. The size of a minimum geodetic set in G is the geodetic number g(G) of G. We find that the geodetic number of the lexicographic product G ∘H for non-complete graphs H lies between 2 and 3g(G). We characterize the graphs G and H for which g(G ∘H) = 2, as well as the lexicograp...
متن کامل